Learnability of type - logi al grammars Sean
نویسنده
چکیده
منابع مشابه
Learnability of type-logical grammars
A procedure for learning a lexical assignment together with a system of syntactic and semantic categories given a fixed type-logical grammar is briefly described. The logic underlying the grammar can be any cut-free decidable modally enriched extension of the Lambek calculus, but the correspondence between syntactic and semantic categories must be constrained so that no infinite set of categori...
متن کاملFeasible learnability of formal grammars and the theory of natural language acquisition
We propose to apply a complexity theoretic notion of feasible learnability called "polynomial learnability" to the evaluation of grammatical formalisms for linguistic description. Polynomial learnability was originally defined by Valiant in the context of boolean concept learning and subsequently generalized by Blumer et al. to infinitary domains. We give a clear, intuitive exposition of this n...
متن کاملLexicalized Well-Founded Grammars: Learnability and Merging
This paper presents the theoretical foundation of a new type of constraint-based grammars, Lexicalized Well-Founded Grammars, which are adequate for modeling human language and are learnable. These features make the grammars suitable for developing robust and scalable natural language understanding systems. Our grammars capture both syntax and semantics and have two types of constraints at the ...
متن کاملLearnability of Pregroup Grammars
This paper investigates the learnability by positive examples in the sense of Gold of Pregroup Grammars. In a first part, Pregroup Grammars are presented and a new parsing strategy is proposed. Then, theoretical learnability and non-learnability results for subclasses of Pregroup Grammars are proved. In the last two parts, we focus on learning Pregroup Grammars from a special kind of input call...
متن کاملCategorial Module Grammars of Bounded Size have Finite Bounded Density
Categorial module grammars are a class of categorial grammars where in place of the lambek calculus (L) as type system, and types, we associate modules to words, that is, linear logic (LL) partial proof structures. However, their learnability conditions w.r.t. Gold’s model remain, as yet, unknown. We provide a definition of this interesting class and show that relevant subclasses of it, most no...
متن کامل